package com.dyz.leetcode._03_mathematics;


public class _66_plusOne {
    public int[] plusOne(int[] digits) {
        for(int i=digits.length-1; i>=0; i--){
            digits[i]++;
            digits[i] = digits[i]%10;
            if(digits[i]!=0){return digits;}
        }
        digits = new int[digits.length + 1];
        digits[0] = 1;
        return digits;
    }
}
